On Partitioning Sidon Sets with Quasi-independent Sets

نویسندگان

  • K. T. Harrison
  • L. Thomas Ramsey
  • THOMAS RAMSEY
چکیده

There is a construction of random subsets of Z in which almost every subset is Sidon (this was first done by Katznelson). More is true: almost every subset is the finite union of quasi-independent sets. Also, if every Sidon subset of Z\{0} is the finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of this last result are proved for all Abelian groups, and for other special Sidon sets (the N -independent sets). Sidon subsets have been characterized by Pisier as having proportional quasiindependent subsets[8]. There remains the open problem of whether Sidon subsets of Z must be finite unions of quasi-independent sets. Grow and Whicher produced an interesting example of a Sidon set whose Pisier proportionality was 1/2 but the set was not the union of two quasi-independent sets [3]. On the other hand, this paper provides probabilistic evidence in favor of an affirmative answer with a construction of random Sidon sets which borrows heavily from ideas of Professors Katznelson and Malliavin [4,5,6]. Katznelson provided a random construction of integer Sidon sets which, almost surely, were not dense in the Bohr compactifaction of the integers [5,6]. This paper presents a modification of that construction and emphasizes a stronger conclusion which is implicit in the earlier construction: almost surely, the random sets are finite unions of quasi-independent sets (also of N -independent sets, defined below). In this paper, random subsets of size O(log nj) are chosen from disjoint arithmetic progressions of length nj (the maximum density allowed for a Sidon set), with nj → ∞ fast enough and the progressions rapidly dilated as j →∞. This paper concludes with several deterministic results. If every Sidon subset of Z\{0} is a finite union of quasi-independent sets, then the required number of quasi-independent sets is bounded by a function of the Sidon constant. Analogs of this result are proved for all Abelian groups, and for other special Sidon sets (the N -independent sets). Throughout this paper, unspecified variables denote positive integers. 1991 Mathematics Subject Classification. 43A56.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

?-Independent and Dissociate Sets on Compact Commutative Strong Hypergroups

In this paper we define ?-independent (a weak-version of independence), Kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and Sidon sets. These sets have the lacunarity or thinness property and are very useful indeed. For example Varopoulos used the Kronecker sets to prove the Malliavin theorem. In t...

متن کامل

Bohr Cluster Points of Sidon Sets

If there is a Sidon subset of the integers Z which has a member of Z as a cluster point in the Bohr compactification of Z, then there is a Sidon subset of Z which is dense in the Bohr compactification. A weaker result holds for quasiindependent and dissociate subsets of Z. It is a long standing open problem whether Sidon subsets of Z can be dense in the Bohr compactification of Z ([LR]). Yitzha...

متن کامل

A STRUCTURAL CRITERION FOR THE EXISTENCE OF INFINITE CENTRAL A(p) SETS

We classify the compact, connected groups which have infinite central A(p) sets, arithmetically characterize central A(p) sets on certain product groups, and give examples of A(p) sets which are non-Sidon and have unbounded degree. These sets are intimately connected with Figà-Talamanca and Rider's examples of Sidon sets, and stem from the existence of families of tensor product representations...

متن کامل

Lacunary Fourier Series for Compact Quantum Groups

This paper is devoted to the study of Sidon sets, Λ(p)-sets and some related notions for compact quantum groups. We establish several different characterizations of Sidon sets, and in particular prove that any Sidon set in a discrete group is a strong Sidon set in the sense of Picardello. We give several relations between Sidon sets, Λ(p)-sets and lacunarities for LFourier multipliers, generali...

متن کامل

Constructions of generalized Sidon sets

We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si ∈ S; such sets are called Sidon sets if g = 2 and generalized Sidon sets (or B2[ ⌈ g/2 ⌉ ] sets) if g ≥ 3. We extend to generalized Sidon sets the Sidon-set constructions of Singer, Bose, and Ruzsa. We also further optimize Koulantzakis’ idea of interleaving sever...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995